Cyclic Routing in Peer-to-Peer Systems
نویسنده
چکیده
Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance the routing overhead vs. routing latency. Cycles in a P2P network are collected at a little extra cost by piggybacking node’s ID into forwarded packets. Cyclic routing is proved to be dependable and improves the performance of Chord’s basic routing algorithms.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملA Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملAnonymity in Structured Peer-to-Peer Networks
Existing peer-to-peer systems that aim to provide anonymity to its users are based on networks with unstructured or loosely-structured routing algorithms. Structured routing offers performance and robustness guarantees that these systems are unable to achieve. We therefore investigate adding anonymity support to structured peer-to-peer networks. We apply an entropy-based anonymity metric to Cho...
متن کاملUniversity of California Riverside Adaptive Data Dissemination and Content-driven Routing in Peer-to-peer Systems Iv Abstract of the Thesis Adaptive Data Dissemination and Content-driven Routing in Peer-to-peer Systems
OF THE THESIS Adaptive Data Dissemination and Content-Driven Routing in Peer-to-Peer Systems by Thomas S. Repantis Master of Science, Graduate Program in Computer Science University of California, Riverside, August 2005 Dr. Vana Kalogeraki, Chairperson Peer-to-Peer systems have emerged as a cost-effective means of sharing data and services and are offering fault-tolerance and self-adaptation in...
متن کاملAdaptive Content-based Routing using Subscription Subgrouping in Structured Overlays
Cyclic or general overlays may provide multiple paths between publishers and subscribers. However, an advertisement tree and a matching subscription activates only one path for notifications routing in publish/subscribe systems. This poses serious challenges in handling network conditions like congestion, and link or broker failures. Further, content-based dynamic routing of notifications requi...
متن کامل